Topology of Generic Line Arrangements
نویسنده
چکیده
Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial f = ∏ i(aix + biy + ci), so that A = (f = 0). We prove that the defining polynomials of two generic line arrangements are, up to a small deformation, topologically equivalent. In higher dimension the related result is that within a family of equivalent hyperplane arrangements the defining polynomials are topologically equivalent.
منابع مشابه
A new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays
In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...
متن کاملHigher Homotopy Groups of Complements of Complex Hyperplane Arrangements
We generalize results of Hattori on the topology of complements of hyperplane arrangements, from the class of generic arrangements, to the much broader class of hypersolvable arrangements. We show that the higher homotopy groups of the complement vanish in a certain combinatorially determined range, and we give an explicit Zπ1-module presentation of πp, the first non-vanishing higher homotopy g...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology An Experimental Study of Point Location in General Planar Arrangements
We study the performance in practice of various point-location algorithms implemented in cgal, including a newly devised Landmarks algorithm. Among the other algorithms studied are: a näıve approach, a “walk along a line” strategy and a trapezoidal-decomposition based search structure. The current implementation addresses general arrangements of arbitrary planar curves, including arrangements o...
متن کاملTopology and combinatorics of real line arrangements
We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in P. Such pair of arrangements has an additional property: they admit conjugated equations on the ring of polynomials over Q( √ 5).
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Exact and Efficient Construction of Planar Arrangements of Circular Arcs and Line Segments with Applications
We describe a simple yet powerful approach for computing planar arrangements of circular arcs and line segments in a robust and exact manner. Constructing arrangements using this approach is about one order of magnitude faster compared to other techniques that employ the exact computation paradigm. We have successfully applied our technique for computing offsets of planar polygons and for perfo...
متن کامل